Balanced decomposition of a vertex-colored graph
نویسندگان
چکیده
منابع مشابه
The Balanced Decomposition Number and Vertex Connectivity
The balanced decomposition number f(G) of a graph G was introduced by Fujita and Nakamigawa [Discr. Appl. Math., 156 (2008), pp. 3339-3344]. A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, such that there is the same number of vertices in each colour. Then, f(G) is the minimum integer s with the following property: For any balanced colouring of G,...
متن کاملDecomposition of bi-colored square arrays into balanced diagonals
Given an n × n array M (n ≥ 7), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of M into n diagonals, each containing at least one cell of each color. As a consequence, it follows that if each color appears in at least 2n − 1 cells, then such a partition exists. The proof uses results on completion of partial Latin ...
متن کاملComplexity issues in vertex-colored graph pattern matching
Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In the context of metabolic network analysis, Lacroix et al [V. Lacroix, C.G. Fernandes and M.-F. Sagot, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3 (2006), no. 4, 360368 ] introduced the NP-hard general problem of finding occurrences of motifs in vertexcolored graphs, wh...
متن کاملComplexity Issues in Vertex-Colored Graph Pattern MatchingI,II
Searching for motifs in graphs has become a crucial problem in the analysis of biological networks. In the context of metabolic network analysis, Lacroix et al [V. Lacroix, C.G. Fernandes and M.-F. Sagot, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3 (2006), no. 4, 360368 ] introduced the NP-hard general problem of finding occurrences of motifs in vertexcolored graphs, wh...
متن کاملVertex-Colored Encompassing Graphs
It is shown that every disconnected vertex-colored plane straight line graph with no isolated vertices can be augmented (by adding edges) into a connected plane straight line graph such that the new edges respect the coloring and the degree of every vertex increases by at most two. The upper bound for the increase of vertex degrees is best possible: there are input graphs that require the addit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.006